Producing a Diverse Set of Near-Optimal Reserve Solutions with Exact Optimisation
نویسندگان
چکیده
Reserves are at the heart of global policies to stop erosion biodiversity. Optimisation is increasingly used identify reserve locations that preserve biodiversity a minimum cost human activities. Two classes algorithms solve this site selection problem: metaheuristic (such as simulated annealing, commonly implemented in Marxan) and exact optimisation (i.e. integer programming, PrioritizR). Although approaches now able large-scale problems, metaheuristics still widely used. One reason metaheuristic-based software provides set suboptimal solutions instead single one. These alternative usually welcomed by stakeholders they provide better basis for negotiations among potentially conflictive objectives. Metaheuristic use random procedures explore space solutions. Therefore, may produce large amount similar, thus uninformative, solutions, which calls heavy statistical post-processing. Effective methods generating diverse near-optimal using lacking. Here we present two new addressing issue. Our explicitly control both optimality gap dissimilarity between It allows identification parsimonious, yet meaningful The presented here could increase uptake practitioners. should contribute less noisy more efficient discussions design conservation policies.
منابع مشابه
Near-optimal solutions for the generalized max-controlled set problem
In this work we deal with sandwich graphs G=(V,E) and present the notion of vertices f-controlled by a subset MDV . We introduce the generalized max-controlled set problem (GMCSP), where minimum gaps (defined by function f) and positive weights are associated to each vertex of V. In this case, the objective is to find a sandwich graph G in order to maximize the sum of the weights associated to ...
متن کاملSubmodBoxes: Near-Optimal Search for a Set of Diverse Object Proposals
This paper formulates the search for a set of bounding boxes (as needed in object proposal generation) as a monotone submodular maximization problem over the space of all possible bounding boxes in an image. Since the number of possible bounding boxes in an image is very large O(#pixels), even a single linear scan to perform the greedy augmentation for submodular maximization is intractable. Th...
متن کاملEXACT SOLUTIONS FOR FLOW OF A SISKO FLUID IN PIPE
By means of He's homotopy perturbation method (HPM) an approximate solution of velocity eld is derived for the ow in straight pipes of non-Newtonian uid obeying the Sisko model. The nonlinear equations governing the ow in pipe are for- mulated and analyzed, using homotopy perturbation method due to He. Furthermore, the obtained solutions for velocity eld is graphically sketched...
متن کاملPrediction of melting points of a diverse chemical set using fuzzy regression tree
The classification and regression trees (CART) possess the advantage of being able to handlelarge data sets and yield readily interpretable models. In spite to these advantages, they are alsorecognized as highly unstable classifiers with respect to minor perturbations in the training data.In the other words methods present high variance. Fuzzy logic brings in an improvement in theseaspects due ...
متن کاملNear Optimal H∞ Tracking for a Compact Set of Plants
Here we consider the problem of providing near optimal performance for a large set of possible models. We adopt the H∞ framework in the single-input single-output (SISO) setting with structured uncertainty: a compact set of controllable and observable plant models of a fixed order; we consider the control problem of designing a controller to minimize the worst case performance. We consider two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environmental Modeling & Assessment
سال: 2022
ISSN: ['1420-2026', '1573-2967']
DOI: https://doi.org/10.1007/s10666-022-09862-1